Reasoning about Composition: A Predicate Transformer Approach
نویسنده
چکیده
As interest in components and composition-related methods is growing rapidly, it is not always clear what the goals (and the corresponding difficulties) actually are. If composition is to become central in the future of software engineering, we need to better identify the fundamental issues that are related to it, before we attempt to solve them as they occur in object-oriented systems or in concurrent and reactive systems. In this paper, we present our formulation of some of the composition problems in a context of formal methods and program specification and verification. This formalization is based on predicate calculus and predicate transformers and aims at remaining as general as possible. This way, we hope to better understand some of the fundamental issues of composition and component-based reasoning.
منابع مشابه
Probabilistic Behavior in Action Systems
Action systems were originally proposed for the design of parallel and distributed systems in a stepwise manner. Later the formalism has been successfully applied to the design of control systems. When designing control systems very often it is necessary to reason about, e.g. the probabilistic reliability of a controller or some other types of prob-abilistic phenomena. Within action systems for...
متن کاملA Weakest Precondition Model for Assembly Language Programs
Reasoning about computer programs requires that program variables have well defined meaning. An imperative program may associate different values with a variable X depending on the state of its execution. This is not true of purely functional programs, which model computation using a composition of state-to-state transformations. By way of illustration, consider a program which sums the first N...
متن کاملVeriication and Reenement of Action Contracts
Action contracts are a formalism for describing an interactive system as a game between two coalitions of agents. A basic contract statement, involving choice points for the diierent agents, is repeatedly executed as an atomic operation (modeled as a monotonic predicate transformer). The possible executions can be described as an alternating tree which in turn can be analysed using a generalisa...
متن کاملRelating State Transformation Semantics and Predicate Transformer Semantics for Parallel Programs
A state transformation semantics and a predicate transformer semantics for programs built from atomic actions, sequential composition, nondeterministic choice, parallel composition, atomisation, and recursion are presented. Both semantic models are derived from some SOS-style labelled transition system. The state transformation semantics and the predicate transformer semantics are shown to be i...
متن کاملwin and sin : Predicate Transformers for Concurrency LESLIE LAMPORT
The weakest liberal precondition and strongest postcondition predicate transformers are generalized to the weakest invariant and strongest invariant. These new predicate transformers are useful for reasoning about concurrent programs containing operations in which the grain of atomicity is unspecified. They can also be used to replace behavioral arguments with more rigorous assertional ones.
متن کامل